A Game Theoretical View of Byzantine Fault Tolerance Design
نویسنده
چکیده
In this paper, we investigate the optimal Byzantine fault tolerance (BFT) design strategies from a game theoretical point of view. The problem of BFT is formulated as a constant-sum game played by the BFT system (defender) and its adversary (attacker). The defender resorts to replication to ensure high reliability and availability, while the attacker injects faults to the defender with the purpose of reducing the system’s reliability and/or availability. We examine current BFT solutions and propose a number of improvements based on our game theoretical study.
منابع مشابه
Lila: A Cheating-Resistant Distributed Game Engine
In this paper we present Lila, a distributed multiplayer game engine that is Byzantine faulttolerant. Lila allows games to be written with little regard for issues such as move replication, rejection of cheating moves, allowing new players to join the game, allowing players to leave the game, and removing cheating or networkpartitioned players from the game. Lila is based on Practical Byzantine...
متن کاملCMSC 858F: Algorithmic Game Theory Fall 2010 Achieving Byzantine Agreement and Broadcast against Rational Adversaries
1 Overview In this presentation, we describe byzantine agreement and broadcast with respect to rational adversaries with particular preferences on the output of the honest players.
متن کاملByung-gon Chun
International Computer Science Institute, Berkeley, CA 2007 – Present Postdoctoral Researcher, Networking Group, working with Prof. Scott Shenker, Dr. Petros Maniatis, and Dr. Sylvia Ratnasamy Diverse replication for single-machine Byzantine-fault tolerance: Investigate exploiting cores in many-core systems to defend against software attacks. Explore different isolation and software diversity m...
متن کاملDesign and implementation of a Byzantine fault tolerance framework for non-deterministic applications
State-machine-based replication is an effective way to increase the availability and dependability of mission-critical applications. However, all practical applications contain some degree of non-determinism. Consequently, ensuring strong replica consistency in the presence of application non-determinism has been one of the biggest challenges in building dependable distributed systems. In this ...
متن کاملDiverse Replication for Single-Machine Byzantine-Fault Tolerance
New single-machine environments are emerging from abundant computation available through multiple cores and secure virtualization. In this paper, we describe the research challenges and opportunities around diversified replication as a method to increase the Byzantine-fault tolerance (BFT) of single-machine servers to software attacks or errors. We then discuss the design space of BFT protocols...
متن کامل